In Accurate CG-Algorithm for Unconstrained Optimization Problems
نویسندگان
چکیده
منابع مشابه
An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملThe Algorithms of Broyden-CG for Unconstrained Optimization Problems
The conjugate gradient method plays an important role in solving large-scaled problems and the quasi-Newton method is known as the most efficient method in solving unconstrained optimization problems. Therefore, in this paper, the new hybrid 2592 Mohd Asrul Hery Ibrahim et al. method between the conjugate gradient method and the quasi-newton method for solving optimization problem is suggested....
متن کاملModified Seeker Optimization Algorithm for Unconstrained Optimization Problems
Seeker optimization algorithm (SOA) is a novel search algorithm based on simulating the act of human searching, which has been shown to be a promising candidate among search algorithms for unconstrained function optimization. In this article we propose a modified seeker optimization algorithm. In order to enhance the performance of SOA, our proposed approach uses two search equations for produc...
متن کاملDiscrete state transition algorithm for unconstrained integer optimization problems
we focus on a recently new intelligent optimization algorithm called discrete state transition algorithm, for solving integer optimization problems. Firstly, we summarize some key elements for discrete state transition algorithm to guide its well development. Several intelligent operators are designed for local exploitation and global exploration. Then, a dynamic adjustment strategy “risk and r...
متن کاملA new hybrid conjugate gradient algorithm for unconstrained optimization
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AL-Rafidain Journal of Computer Sciences and Mathematics
سال: 2004
ISSN: 2311-7990
DOI: 10.33899/csmj.2004.164096